AdaMF: Adaptive Boosting Matrix Factorization for Recommender System
نویسندگان
چکیده
Matrix Factorization (MF) is one of the most popular approaches for recommender systems. Existing MF-based recommendation approaches mainly focus on the prediction of the users’ ratings on unknown items. The performance is usually evaluated by the metric Root Mean Square Error (RMSE). However, achieving good performances in terms of RMSE does not guarantee a good performance in the top-N recommendation. Therefore, we advocate that treating the recommendation as a ranking problem. In this study, we present a ranking-oriented recommender algorithm AdaMF, which combines the MF model with AdaRank. Specifically, we propose an algorithm by adaptively combining component MF recommenders with boosting methods. The combination shows superiority in both ranking accuracy and model generalization. Normalized Discounted Cumulative Gain (NDCG) is chosen as the parameter of the coefficient function for each MF recommenders. In addition, we compare the proposed approach with the traditional MF approach and the state-of-the-art recommendation algorithms. The experimental results confirm that our proposed approach outperforms the state-of-the-art approaches.
منابع مشابه
A new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملA social recommender system based on matrix factorization considering dynamics of user preferences
With the expansion of social networks, the use of recommender systems in these networks has attracted considerable attention. Recommender systems have become an important tool for alleviating the information that overload problem of users by providing personalized recommendations to a user who might like based on past preferences or observed behavior about one or various items. In these systems...
متن کاملLearning from Incomplete Ratings using Nonlinear Multi-layer Semi-Nonnegative Matrix Factorization
Recommender systems problems witness a growing interest for finding better learning algorithms for personalized information. Matrix factorization that estimates the user liking for an item by taking an inner product on the latent features of users and item have been widely studied owing to its better accuracy and scalability. However, it is possible that the mapping between the latent features ...
متن کاملAn Adaptive Matrix Factorization Approach for Personalized Recommender Systems
Given a set $U$ of users and a set of items $I$, a dataset of recommendations can be viewed as a sparse rectangular matrix $A$ of size $|U|\times |I|$ such that $a_{u,i}$ contains the rating the user $u$ assigns to item $i$, $a_{u,i}=?$ if the user $u$ has not rated the item $i$. The goal of a recommender system is to predict replacements to the missing observations $?$ in $A$ in order to make ...
متن کاملHybrid Adaptive Educational Hypermedia Recommender Accommodating User’s Learning Style and Web Page Features
Personalized recommenders have proved to be of use as a solution to reduce the information overload problem. Especially in Adaptive Hypermedia System, a recommender is the main module that delivers suitable learning objects to learners. Recommenders suffer from the cold-start and the sparsity problems. Furthermore, obtaining learner’s preferences is cumbersome. Most studies have only focused...
متن کامل